The number of maximal matchings in polyphenylene chains
نویسندگان
چکیده مقاله:
A matching is maximal if no other matching contains it as a proper subset. Maximal matchings model phenomena across many disciplines, including applications within chemistry. In this paper, we study maximal matchings in an important class of chemical compounds: polyphenylenes. In particular, we determine the extremal polyphenylene chains in regards to the number of maximal matchings. We also determine recurrences and generating functions for the sequences enumerating maximal matchings in several specific types of polyphenylenes and use these results to analyze the asymptotic behavior.
منابع مشابه
Global Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولOn the size of maximal antichains and the number of pairwise disjoint maximal chains
Fix integers n and k with n ≥ k ≥ 3. Duffus and Sands proved that if P is a finite poset and n ≤ |C| ≤ n+ (n− k)/(k− 2) for every maximal chain in P , then P must contain k pairwise disjoint maximal antichains. They also constructed a family of examples to show that these inequalities are tight. These examples are 2-dimensional which suggests that the dual statement may also hold. In this paper...
متن کاملDynamic Rank-Maximal Matchings
We consider the problem of matching applicants to posts where applicants have preferences over posts. Thus the input to our problem is a bipartite graph G = (A ∪ P , E), where A denotes a set of applicants, P is a set of posts, and there are ranks on edges which denote the preferences of applicants over posts. A matching M in G is called rank-maximal if it matches the maximum number of applican...
متن کاملMatchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchings, where a matching is k-maximal if it admits no augmenting path with ≤ 2k vertices. The second involves finding a maximal set of vertices that is matchable — comprising one side of the edges in some matching. Among ou...
متن کاملthe effect of the record infancy in crimilly acts of guilties (in karaj city)
چکیده یکی از مهمترین دغدغه های بزرگ جوامع بشری، از دیر باز تا کنون که ذهن پژوهشگران و متخصصان بهداشت روانی و اجتماعی و دولتها رابه خود مشغول داشته، مسأله ی بزهکاری می باشد. شناخت کامل پدیده ی بزهکاری و بزهکار، علل وعوامل سقوط یک انسان، چگونگی درمان وی و درنهایت پیشگیری ازبزهکاری ودریک کلام سالم سازی یک جامعه، رسالت عظیم، انسانی ومقدسی می باشد که با بررسی شخصیت مجرم یعنی[ انسانی که تحت شرای...
15 صفحه اولمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 10 شماره 4
صفحات 343- 360
تاریخ انتشار 2019-12-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023